A greedy search tree heuristic for symbolic regression
نویسندگان
چکیده
منابع مشابه
A Greedy Search Tree Heuristic for Symbolic Regression
Symbolic Regression tries to find a mathematical expression that describes the relationship of a set of explanatory variables to a measured variable. The main objective is to find a model that minimizes the error and, optionally, that also minimizes the expression size. A smaller expression can be seen as an interpretable model considered a reliable decision model. This is often performed with ...
متن کاملBuilding a Heuristic for Greedy Search
Suboptimal heuristic search algorithms such as greedy bestfirst search allow us to find solutions when constraints of either time, memory, or both prevent the application of optimal algorithms such as A*. Guidelines for building an effective heuristic for A* are well established in the literature, but we show that if those rules are applied for greedy best-first search, performance can actually...
متن کاملA Heuristic Greedy Algorithm for Scheduling Out-Tree Task Graphs
The scheduling of Out-Tree task graphs is one of the critical factors in implementing the compilers of parallel languages and improving the performance of parallel computing. Although there are a few heterogeneity based algorithms in the literature suitable for scheduling Out-Tree task graphs, they usually require significantly high scheduling costs and may not deliver good quality schedules wi...
متن کاملPotential Search: A New Greedy Anytime Heuristic Search
In this paper we explore a novel approach for anytime heuristic search, in which the node that is most probable to improve the incumbent solution is expanded first. This is especially suited for the ”anytime aspect” of anytime algorithms the possibility that the algorithm will be be halted anytime throughout the search. The potential of a node to improve the incumbent solution is estimated by a...
متن کاملSymbolic Heuristic Search for Probabilistic Planning
We describe a planner that participates in the Probabilistic Planning Track of the 2004 International Planning Competition. Our planner integrates two approaches to solving Markov decision processes with large state spaces. State abstraction is used to avoid evaluating states individually. Forward search from a start state, guided by an admissible heuristic, is used to avoid evaluating all states.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2018
ISSN: 0020-0255
DOI: 10.1016/j.ins.2018.02.040